Blocking Analysis of Time-Driven Switching

نویسندگان

  • Viet-Thang Nguyen
  • Renato Lo Cigno
  • Yoram Ofek
چکیده

This paper presents a complete closed-form timedomain analysis of the blocking probability of time-driven switching (TDS) for the single node case. In this work blocking is defined as the occurrence in which transmission resources are available in both inlet and outlet, but there is no schedule. The main constraints for finding a schedule are: (i) the load and (ii) the maximum scheduling delay between inlet availability and outlet availability. As the maximum scheduling delay (buffering) increases the blocking probability is reduced. The outcome of the analysis in this paper is the exact blocking probabilities for all possible maximum scheduling delays, under all load conditions.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Time Blocking in Time-Driven-Switched Networks

This paper presents a closed-form analysis of the time-blocking probability in time-driven switching networks. Time-blocking occurs when transmission resources are available in both input and output, but there is no schedule, i.e., output resources are outside a pre-defined time delay that is allowed for the input. This situation may happen in architectures based on pipeline forwarding. The mai...

متن کامل

Blocking Probability with Time-driven Priority Scheduling

This paper provides a methodology for evaluating call blocking probability over packet-switched networks with Time-driven priority (TDP) [4][5] and obtained results. The approach presented in this work is novel, since call blocking is typically studied in the context of circuit-switched networks. TDP together with resource reservation enable real-time delivery of packets with no loss due to con...

متن کامل

Non-Blocking Routers Design Based on West First Routing Algorithm & MZI Switches for Photonic NoC

For the first time, the 4- and 5-port optical routers are designed by using the West First routing algorithm for use in optical network on chip. The use of the WF algorithm has made the designed routers to provide non-blocking routing in photonic network on chip. These routers not only are based on high speed Mach-Zehnder switches(Which have a higher bandwidth and more thermal tolerance than mi...

متن کامل

Improvement of Schedulability Analysis with a Priority Share Policy in On-Chip Networks

Priority-based wormhole switching with a priority share policy has been proposed as a possible solution for real-time on-chip communication. However, the blocking introduced by priority share complicates the analysis process. In this paper, we propose a new “per-priority” basis analysis scheme which computes the total time window at each priority level instead of each traffic-flow. By checking ...

متن کامل

Non-Blocking Routers Design Based on West First Routing Algorithm & MZI Switches for Photonic NoC

For the first time, the 4- and 5-port optical routers are designed by using the West First routing algorithm for use in optical network on chip. The use of the WF algorithm has made the designed routers to provide non-blocking routing in photonic network on chip. These routers not only are based on high speed Mach-Zehnder switches(Which have a higher bandwidth and more thermal tolerance than mi...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006